On the Complexity of the Control Language in Tree Controlled Grammars
نویسندگان
چکیده
It is shown that any context-sensitive language can be generated by a tree controlled grammar whose control language is accepted by a deterministic finite automaton with at most 5 states.
منابع مشابه
Alternating Regular Tree Grammars in the Framework of Lattice-Valued Logic
In this paper, two different ways of introducing alternation for lattice-valued (referred to as {L}valued) regular tree grammars and {L}valued top-down tree automata are compared. One is the way which defines the alternating regular tree grammar, i.e., alternation is governed by the non-terminals of the grammar and the other is the way which combines state with alternation. The first way is ta...
متن کاملNonterminal complexity of tree controlled grammars
This paper studies the nonterminal complexity of tree controlled grammars. It is proved that the number of nonterminals in tree controlled grammars without erasing rules leads to an infinite hierarchy of families of tree controlled languages, while every recursively enumerable language can be generated by a tree controlled grammar with erasing rules and at most nine nonterminals. © 2011 Elsevie...
متن کاملStudying impressive parameters on the performance of Persian probabilistic context free grammar parser
In linguistics, a tree bank is a parsed text corpus that annotates syntactic or semantic sentence structure. The exploitation of tree bank data has been important ever since the first large-scale tree bank, The Penn Treebank, was published. However, although originating in computational linguistics, the value of tree bank is becoming more widely appreciated in linguistics research as a whole. F...
متن کاملLanguage Classes Generated by Tree Controlled Grammars with Bounded Nonterminal Complexity
A tree controlled grammar is specified as a pair (G,G) where G is a context-free grammar and G is a regular grammar. Its language consists of all terminal words with a derivation in G such that all levels of the corresponding derivation tree – except the last level – belong to L(G). We define the nonterminal complexity Var(H) of H = (G,G) as the sum of the numbers of nonterminals of G and G. In...
متن کاملOn Two Hierarchies of Subregularly Tree Controlled Languages
Tree controlled grammars are context-free grammars where the associated language only contains those terminal words which have a derivation where the word of any level of the corresponding derivation tree belongs to a given regular language. In this paper, we consider first the case that we take only such regular languages as the control set which can be represented by finite unions of monoids....
متن کامل